A Review of Heuristics and Hybrid Methods for Green Vehicle Routing Problems considering Emissions
نویسندگان
چکیده
Road freight transport is one of the sectors with highest greenhouse gas emissions and fuel consumption in logistics industry. In recent years, due to increase carbon dioxide emissions, several companies have considered reducing them their daily operations by means better routing management. Green vehicle problems (GVRPs) constitute a growing problem direction within interplay environmental sustainability that aims provide effective routes while considering concerns. These NP-hard are most studied ones green logistics, difficulty, there many different heuristic hybrid techniques solve under need having high-quality solutions reasonable computational time. Given role importance these methods, this review at providing comprehensive overview reviewing defining strategies components. addition, we analyze characteristics components related how being considered. Lastly, map benchmarks proposed so far for GVRP variants emissions.
منابع مشابه
A New Mathematical Model for the Green Vehicle Routing Problem by Considering a Bi-Fuel Mixed Vehicle Fleet
This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...
متن کاملA hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center
This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملEfficient Insertion Heuristics for Vehicle Routing and Scheduling Problems
Insertion heuristics have proven to be popular methods for solving a variety of vehicle routing and scheduling problems. In this paper, we focus on the impact of incorporating complicating constraints on the efficiency of insertion heuristics. The basic insertion heuristic for the standard vehicle routing problem has a time complexity of O(n). However, straightforward implementations of handlin...
متن کاملLearning Hybrid Algorithms for Vehicle Routing Problems
This paper presents a generic technique for improving hybrid algorithms through the discovery of and tuning of meta-heuristics. The idea is to represent a family of “push/pull” heuristics that are based upon inserting and removing tasks in a current solution, with an algebra. We then let a learning algorithm search for the best possible algebraic term, which represents a hybrid algorithm for a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Transportation
سال: 2022
ISSN: ['0197-6729', '2042-3195']
DOI: https://doi.org/10.1155/2022/5714991